The Shrinking Generator: Some Practical Considerations

نویسنده

  • Hugo Krawczyk
چکیده

The Shrinking Generator, presented at Crypto'93, is a LFSR-based pseudorandom generator suitable for the implementation of additive stream ciphers. It is particularly simple and has attractive security properties. (The reader is referred to [1] for the definition of the generator and its properties). Although the algorithm was originally intended for hardware implementation, here we will focus on some initial results of an experimental software implementation and other practical considerations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator

In this paper we propose a new guess-and-determine attack on the self-shrinking generator (SSG), proposed by Meier and Staffelbach at Eurocrypt’94. The main idea of our attack consists in guessing some information about the internal bitstream of SSG, and expressing this information by a system of polynomial equations on the still unknown key bits. From a practical point of view, we show that us...

متن کامل

BDD-Based Cryptanalysis of Keystream Generators

Many of the keystream generators which are used in practice are LFSR-based in the sense that they produce the keystream according to a rule y = C(L(x)), where L(x) denotes an internal linear bitstream, produced by a small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. We present an n2 time bounded attack, the FBDD-attack, against L...

متن کامل

The Bit-Search Generator

We present the construction of a pseudorandom generator, that we call the Bit-Search Generator (BSG), based on a single input sequence. The construction is related to the so-called Self-Shrinking Generator which is known for its simplicity (conception and implementation-wise) linked with some interesting properties. After presenting the general running, we give a description of the BSG by using...

متن کامل

N-adic Summation-Shrinking Generator. Basic properties and empirical evidences

The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....

متن کامل

On Some Properties of the Shrinking Generator

We obtain several results about the output rate and distribution of zeros and ones of the shrinking generator associated with two linear recurring sequences. These results are based on various bounds on the number of zeros of linear recurring sequences. Non-linear recurring sequences are considered as well.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993